One entry for each real page of memory Shared by all active processes Entry consists of the virtual address of the page stored in that real memory location. Decreases memory needed to store each page table, but increases time needed to search the table when a page reference occurs.

Saves memory. System not as simple as indexing into a table. Faster context switch (one table for all processes). Problems with sharing.

Page number portion of a virtual address is mapped into a hash value. Hash value points to inverted page table. Fixed proportion of real memory is required for the tables regardless of the number of processes.